A Possibilistic Logic Encoding of Access Control
نویسندگان
چکیده
This paper proposes a modelling of information security policies in the framework of possibilistic logic. Our modelling is based on the concept of roles associated with users. Access control rules, guaranteeing the properties of confidentiality and integrity, are encoded in terms of stratified knowledges bases. The stratification reflects the hierarchy between roles and is very useful for dealing with conflicts.
منابع مشابه
Interpretable Encoding of Densities Using Possibilistic Logic
Probability density estimation from data is a widely studied problem. Often, the primary goal is to faithfully mimic the underlying empirical density. Having an interpretable model that allows insight into why certain predictions were made is often of secondary importance. Using logic-based formalisms, such as Markov logic, can help with interpretability, but even in Markov logic it can be diff...
متن کاملProduct-based Causal Networks and Quantitative Possibilistic Bases
In possibility theory, there are two kinds of possibilistic causal networks depending if possibilistic conditioning is based on the minimum or on the product operator. Similarly there are also two kinds of possibilistic logic: standard (min-based) possibilistic logic and quantitative (product-based) possibilistic logic. Recently, several equivalent transformations between standard possibilistic...
متن کاملIntroducing possibilistic logic in ILP for dealing with exceptions
In this paper we propose a new formalization of the inductive logic programming (ILP) problem for a better handling of exceptions. It is now encoded in first-order possibilistic logic. This allows us to handle exceptions by means of prioritized rules, thus taking lessons from non-monotonic reasoning. Indeed, in classical first-order logic, the exceptions of the rules that constitute a hypothesi...
متن کاملEncoding Markov logic networks in Possibilistic Logic
Markov logic uses weighted formulas to compactly encode a probability distribution over possible worlds. Despite the use of logical formulas, Markov logic networks (MLNs) can be difficult to interpret, due to the often counter-intuitive meaning of their weights. To address this issue, we propose a method to construct a possibilistic logic theory that exactly captures what can be derived from a ...
متن کاملPossibilistic Nested Logic Programs
We introduce the class of possibilistic nested logic programs. These possibilistic logic programs allow us to use nested expressions in the bodies and the heads of their rules. By considering a possibilistic nested logic program as a possibilistic theory, a construction of a possibilistic logic programing semantics based on answer sets for nested logic programs and the proof theory of possibili...
متن کامل